Priestley Duality for Strong Proximity Lattices
نویسندگان
چکیده
منابع مشابه
Priestley Duality for Strong Proximity Lattices
In 1937 Marshall Stone extended his celebrated representation theorem for Boolean algebras to distributive lattices. In modern terminology, the representing topological spaces are zero-dimensional stably compact, but typically not Hausdorff. In 1970, Hilary Priestley realised that Stone’s topology could be enriched to yield orderdisconnected compact ordered spaces. In the present paper, we gene...
متن کاملPriestley duality for N4-lattices
We present a new Priestley-style topological duality for bounded N4-lattices, which are the algebraic counterpart of paraconsistent Nelson logic. Our duality differs from the existing one, due to Odintsov, in that we only rely on Esakia duality for Heyting algebras and not on the duality for De Morgan algebras of Cornish and Fowler. A major advantage of our approach is that for our topological ...
متن کاملPriestley duality for (modal) N4-lattices
N4-lattices are the algebraic semantics of paraconsistent Nelson logic, which was introduced in [1] as an inconsistency-tolerant counterpart of the better-known logic of Nelson [7, 13]. Paraconsistent Nelson logic combines interesting features of intuitionistic, classical and many-valued logics (e.g., Belnap-Dunn four-valued logic); recent work has shown that it can also be seen as one member o...
متن کاملPriestley Duality for Bilattices
We develop a Priestley-style duality theory for different classes of algebras having a bilattice reduct. A similar investigation has already been realized by B. Mobasher, D. Pigozzi, G. Slutzki and G. Voutsadakis, but only from an abstract category-theoretic point of view. In the present work we are instead interested in a concrete study of the topological spaces that correspond to bilattices a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2006
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2006.04.011